Minimizing the Sum of Job Completion times for Washing Operations in Hospital Sterilization Services
نویسندگان
چکیده
In this paper, we deal with the problem of minimizing the sum of completion times for washing operations in hospital sterilization services. After use in operating rooms, reusable medical devices (RMD) are sent to the sterilization service which is composed of various processes. In the washing step, different sets of RMD, used for different operations, may be washed together without exceeding washer capacity. For organizational reasons, we are not allowed to split RMD sets. So, we consider a batch scheduling problem where RMD sets may have different sizes and different release dates for washing. Note that if all release dates are equal, the problem may be reduced to a bin packing problem. We provide a mixed integer linear programming model which aims at minimizing the sum of completion times for washing cycles. We provide and also experiment some heuristics based on classical bin packing algorithms.
منابع مشابه
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
In this paper, we address the problem of parallel batching of jobs on identical machines to minimize makespan. The problem is motivated from the washing step of hospital sterilization services where jobs have different sizes, different release dates and equal processing times. Machines can process more than one job at the same time as long as the total size of jobs in a batch does not exceed th...
متن کاملFast Edge-Orientation Heuristics for Job-Shop Scheduling Problems with Applications to Train Scheduling
A train scheduling problem in a single-track railway can be modeled as a job-shop scheduling problem. We use a mixed graph model for such a job-shop problem with appropriate criteria. There are several performance evaluations for a train schedule. Optimizing a train schedule subtends minimizing total tardiness of the trains, minimizing the sum of train transit times, minimizing the makespan for...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کاملThe Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weighted sum of job completion times (with respect to different job weights). This problem is NP-hard, and we provide a polynomial time approximation scheme for this problem. Our method is based on Lagrangian relaxation mix...
متن کاملMeta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010